Bounded saturation-based CTL model checking
نویسندگان
چکیده
منابع مشابه
Efficient Saturation-based Bounded Model Checking of Asynchronous Systems
Formal verification is becoming a fundamental step in assuring the correctness of safety-critical systems. However, due to these systems being often asynchronous and even distributed, their behaviour can be very complex. Thus, their verification necessitates methods that can deal with huge or even infinite state spaces. In this paper we present how the integration of two advanced algorithms for...
متن کاملSymbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation
The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivated by efficiently applying saturation to CTL model checking. First, we introduce a new “constrained saturation” algorithm which constrains state exploration to a set of states satisfying given properties. This algorithm avoids t...
متن کاملRevising Specifications with CTL Properties Using Bounded Model Checking
During the process of software development, it is very common that inconsistencies arise between the formal specification and some desired property. Belief Revision deals with the problem of accommodating new information that may be inconsistent with an existing knowledge base. In this paper, we propose the use of belief revision techniques in order to deal with inconsistencies in formal specif...
متن کاملModel Checking Ctl Is
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations—restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004). For all these fragments, except for the trivial case without any temporal operator...
متن کاملModel Checking Games for CTL
We define model checking games for the temporal logic CTL∗ and prove their correctness. They provide a technique for using model checking interactively in a verification/specification process. Their main feature is to construct paths in a transition system stepwise. That enables them to be the basis for a local model checking algorithm with a natural notion of justification. However, this requi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Estonian Academy of Sciences
سال: 2013
ISSN: 1736-6046
DOI: 10.3176/proc.2013.1.07